Learning Typed Entailment Graphs with Global Soft Constraints
نویسندگان
چکیده
منابع مشابه
Global Learning of Typed Entailment Rules
Extensive knowledge bases of entailment rules between predicates are crucial for applied semantic inference. In this paper we propose an algorithm that utilizes transitivity constraints to learn a globally-optimal set of entailment rules for typed predicates. We model the task as a graph learning problem and suggest methods that scale the algorithm to larger graphs. We apply the algorithm over ...
متن کاملEfficient Global Learning of Entailment Graphs
Entailment rules between predicates are fundamental to many semantic-inference applications. Consequently, learning such rules has been an active field of research in recent years. Methods for learning entailment rules between predicates that take into account dependencies between different rules (e.g., entailment is a transitive relation) have been shown to improve rule quality, but suffer fro...
متن کاملGlobal Learning of Focused Entailment Graphs
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed edges, and use a global transitivity constraint on the graph to learn the optimal set of edges, by formulating the optimization problem as an Integer Linear Program. We motivate this graph with an application that provid...
متن کاملGlobal Learning of Textual Entailment Graphs
Two decades after the introduction of the World Wide Web, the world is experiencing an “information explosion”, that is, a rapid increase in the amount of available textual information (55). Consequently, the longstanding dream of developing systems that perform semantic inference over natural language text has become ever more pressing. Such systems are invaluable for many natural language und...
متن کاملSOGgy Constraints: Soft Open Global Constraints
We investigate soft open constraints. We generalize and unify classes of soft constraints and adapt them to the open setting. We give sufficient conditions for generalized classes of decomposition-based and edit-based soft constraints to be contractible. Finally, we outline a propagator for an open generalized edit-based soft Regular constraint.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Association for Computational Linguistics
سال: 2018
ISSN: 2307-387X
DOI: 10.1162/tacl_a_00250